TSTP Solution File: NUM736^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM736^1 : TPTP v8.1.2. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 08:14:53 EDT 2024
% Result : Theorem 0.13s 0.40s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of formulae : 29 ( 12 unt; 11 typ; 0 def)
% Number of atoms : 52 ( 14 equ; 0 cnn)
% Maximal formula atoms : 2 ( 2 avg)
% Number of connectives : 154 ( 8 ~; 3 |; 0 &; 140 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 10 ( 0 ^ 10 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
frac: $tType ).
thf(type_def_6,type,
nat: $tType ).
thf(func_def_0,type,
frac: $tType ).
thf(func_def_1,type,
x: frac ).
thf(func_def_2,type,
y: frac ).
thf(func_def_3,type,
nat: $tType ).
thf(func_def_4,type,
more: nat > nat > $o ).
thf(func_def_5,type,
ts: nat > nat > nat ).
thf(func_def_6,type,
num: frac > nat ).
thf(func_def_7,type,
den: frac > nat ).
thf(func_def_9,type,
less: nat > nat > $o ).
thf(f19,plain,
$false,
inference(subsumption_resolution,[],[f18,f16]) ).
thf(f16,plain,
( ( less @ ( ts @ ( num @ y ) @ ( den @ x ) ) @ ( ts @ ( num @ x ) @ ( den @ y ) ) )
!= $true ),
inference(cnf_transformation,[],[f12]) ).
thf(f12,plain,
( ( less @ ( ts @ ( num @ y ) @ ( den @ x ) ) @ ( ts @ ( num @ x ) @ ( den @ y ) ) )
!= $true ),
inference(flattening,[],[f11]) ).
thf(f11,plain,
( ( less @ ( ts @ ( num @ y ) @ ( den @ x ) ) @ ( ts @ ( num @ x ) @ ( den @ y ) ) )
!= $true ),
inference(fool_elimination,[],[f10]) ).
thf(f10,plain,
~ ( less @ ( ts @ ( num @ y ) @ ( den @ x ) ) @ ( ts @ ( num @ x ) @ ( den @ y ) ) ),
inference(rectify,[],[f4]) ).
thf(f4,negated_conjecture,
~ ( less @ ( ts @ ( num @ y ) @ ( den @ x ) ) @ ( ts @ ( num @ x ) @ ( den @ y ) ) ),
inference(negated_conjecture,[],[f3]) ).
thf(f3,conjecture,
less @ ( ts @ ( num @ y ) @ ( den @ x ) ) @ ( ts @ ( num @ x ) @ ( den @ y ) ),
file('/export/starexec/sandbox/tmp/tmp.5PzDTQU9yt/Vampire---4.8_5427',satz42) ).
thf(f18,plain,
( ( less @ ( ts @ ( num @ y ) @ ( den @ x ) ) @ ( ts @ ( num @ x ) @ ( den @ y ) ) )
= $true ),
inference(trivial_inequality_removal,[],[f17]) ).
thf(f17,plain,
( ( ( less @ ( ts @ ( num @ y ) @ ( den @ x ) ) @ ( ts @ ( num @ x ) @ ( den @ y ) ) )
= $true )
| ( $true != $true ) ),
inference(superposition,[],[f14,f15]) ).
thf(f15,plain,
( ( more @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ) )
= $true ),
inference(cnf_transformation,[],[f7]) ).
thf(f7,plain,
( ( more @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ) )
= $true ),
inference(fool_elimination,[],[f6]) ).
thf(f6,plain,
more @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
more @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ),
file('/export/starexec/sandbox/tmp/tmp.5PzDTQU9yt/Vampire---4.8_5427',m) ).
thf(f14,plain,
! [X0: nat,X1: nat] :
( ( ( more @ X1 @ X0 )
!= $true )
| ( ( less @ X0 @ X1 )
= $true ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f13,plain,
! [X0: nat,X1: nat] :
( ( ( less @ X0 @ X1 )
= $true )
| ( ( more @ X1 @ X0 )
!= $true ) ),
inference(ennf_transformation,[],[f9]) ).
thf(f9,plain,
! [X1: nat,X0: nat] :
( ( ( more @ X1 @ X0 )
= $true )
=> ( ( less @ X0 @ X1 )
= $true ) ),
inference(fool_elimination,[],[f8]) ).
thf(f8,plain,
! [X0: nat,X1: nat] :
( ( more @ X1 @ X0 )
=> ( less @ X0 @ X1 ) ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
! [X1: nat,X0: nat] :
( ( more @ X0 @ X1 )
=> ( less @ X1 @ X0 ) ),
file('/export/starexec/sandbox/tmp/tmp.5PzDTQU9yt/Vampire---4.8_5427',satz11) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.15 % Problem : NUM736^1 : TPTP v8.1.2. Released v3.7.0.
% 0.10/0.17 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.38 % Computer : n010.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8042.1875MB
% 0.13/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Fri May 3 14:45:08 EDT 2024
% 0.13/0.38 % CPUTime :
% 0.13/0.38 This is a TH0_THM_NEQ_NAR problem
% 0.13/0.38 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.5PzDTQU9yt/Vampire---4.8_5427
% 0.13/0.40 % (5543)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (2999ds/18Mi)
% 0.13/0.40 % (5543)First to succeed.
% 0.13/0.40 % (5536)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (2999ds/183Mi)
% 0.13/0.40 % (5539)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.13/0.40 % (5538)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (2999ds/27Mi)
% 0.13/0.40 % (5537)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (2999ds/4Mi)
% 0.13/0.40 % (5541)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.13/0.40 % (5542)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (2999ds/275Mi)
% 0.13/0.40 % (5539)Instruction limit reached!
% 0.13/0.40 % (5539)------------------------------
% 0.13/0.40 % (5539)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.40 % (5543)Refutation found. Thanks to Tanya!
% 0.13/0.40 % SZS status Theorem for Vampire---4
% 0.13/0.40 % SZS output start Proof for Vampire---4
% See solution above
% 0.13/0.40 % (5543)------------------------------
% 0.13/0.40 % (5543)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.40 % (5543)Termination reason: Refutation
% 0.13/0.40
% 0.13/0.40 % (5543)Memory used [KB]: 5500
% 0.13/0.40 % (5543)Time elapsed: 0.004 s
% 0.13/0.40 % (5543)Instructions burned: 2 (million)
% 0.13/0.40 % (5543)------------------------------
% 0.13/0.40 % (5543)------------------------------
% 0.13/0.40 % (5535)Success in time 0.004 s
% 0.13/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------